Memory Function versus Binary Correlator in Additive Markov Chains
نویسندگان
چکیده
We study properties of the additive binary Markov chain with short and longrange correlations. A new approach is suggested that allows one to express global statistical properties of a binary chain in terms of the so-called memory function. The latter is directly connected with the pair correlator of a chain via the integral equation that is analyzed in great detail. To elucidate the relation between the memory function and pair correlator, some specific cases were considered that may have important applications in different fields.
منابع مشابه
Entropy and long-range correlations in DNA sequences
We analyze the structure of DNA molecules of different organisms by using the additive Markov chain approach. Transforming nucleotide sequences into binary strings, we perform statistical analysis of the corresponding "texts". We develop the theory of N-step additive binary stationary ergodic Markov chains and analyze their differential entropy. Supposing that the correlations are weak we expre...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملDiscrete Denoising for Channels with Memory
We consider the problem of estimating a discrete signal X = (X1, . . . , Xn) based on its noise-corrupted observation signal Z = (Z1, . . . , Zn). The noise-free, noisy, and reconstruction signals are all assumed to have components taking values in the same finite M -ary alphabet {0, . . . , M − 1}. For concreteness we focus on the additive noise channel Zi = Xi + Ni, where addition is modulo-M...
متن کاملUncoded optimal binary communication for sources withmemory using the BurrowsWheeler Transform
Given an AWGN channel, we look at the problem of designing an optimal binary uncoded communication system for transmitting blocks of binary symbols generated by a stationary source with memory modelled by a Markov chain (MC) or a hidden Markov model (HMM). The goal is to minimize the average SNR required for a given block error rate. The particular case where the binary source is memoryless wit...
متن کاملAlmost Sure Convergence of Relative Frequency of Occurrence of Burst Errors on Channels with Memory∗
Motivated by intention to evaluate asymptotically multiple-burst-error-correcting codes on channels with memory, we will derive the following fact. Let {Zi} be a hidden Markov process, i.e., a functional of a Markov chain with a finite state space, and Wb(Z1Z2 . . . Zn) denote the number of burst errors that appear in Z1Z2 . . . Zn, where the number of burst errors is counted using Gabidulin’s ...
متن کامل